Computational Content of Unique Decomposition Proofs
نویسندگان
چکیده
languages usually involves proving a decomposition theorem. Not only is such a proof tedious, un-inspiring, and error-prone, but also it is usually attempted many times during the design of a theory. With an eye towards automation, we develop an algorithm for checking the statement of the decomposition theorem. Our algorithm is expressed as a sound and complete term rewriting system with respect to a more general term rewriting system that represents all legal proof steps. In addition, our algorithm is strong enough to check for unique decomposition of terms. The current work forms the basis of a system of task speciic tools for supporting work with syntactic theories of programming languages.
منابع مشابه
Finding Computational Content in Classical Proofs
We illustrate the effectiveness of proof transformations which expose the computational content of classical proofs even in cases where it is not apparent. We state without proof a theorem that these transformations apply to proofs in a fragment of type theory and discuss their implementation in Nuprl. We end with a discussion of the applications to Higman's lemma [13, 21, 10] by the second aut...
متن کاملNumerical solution of time-dependent foam drainage equation (FDE)
Reduced Differental Transform Method (RDTM), which is one of the useful and effective numerical method, is applied to solve nonlinear time-dependent Foam Drainage Equation (FDE) with different initial conditions. We compare our method with the famous Adomian Decomposition and Laplace Decomposition Methods. The obtained results demonstrated that RDTM is a powerful tool for solving nonlinear part...
متن کاملScenario-based modeling for multiple allocation hub location problem under disruption risk: multiple cuts Benders decomposition approach
The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملSum-of-squares proofs and the quest toward optimal algorithms
In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly suggest that this tailoring is not necessary and that a single efficient algorithm could achieve best possible guarantees for a wide range of different problems...
متن کامل